1789A - Serval and Mocha's Array - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;

#define ll long long
//#define f first
//#define s second
#define gog ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define pb(a) push_back(a)

mt19937_64 rnd;

ll gcd(ll a, ll b){
    while(b!=0){
        ll t = b;
        b = a%b;
        a=t;
    }
    return a;
}

void solve() {
    ll n, cur=1e9;
    cin >> n;
    vector<ll>v(n);
    for(int i = 0; i < n;++i){
        cin>>v[i];
    }
    for(int i = 0; i < n; ++i){
        for(int j = i+1; j < n; ++j){
            cur = min(cur, gcd(v[i], v[j]));
            if (cur<=2){
                cout << "Yes\n";
                return;
            }
        }
    }
    cout<<"No\n";
}

signed main() {
    gog;
    ll t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}